On a K4-UH self-dual 1-configuration (1024)1
نویسنده
چکیده
Self-dual 1-configurations (nd)1 have the most Kd-separated Menger graph Y for connected self-dual configurations (nd). Such Y is most symmetric if it is Kd-ultrahomogeneous. In this work, such a graph Y is presented for (n, d) = (102, 4) and shown to relate n copies of the cuboctahedral graph L(Q3) to the n copies of K4. These are shown to share each copy of K3 with two copies of L(Q3). Vertices and copies of L(Q3) in Y are the points and lines of a self-dual (10412)1.
منابع مشابه
On a self-dual (1024)-configuration
A connected edge-disjoint union Y of 102 tetrahedra (copies ofK4) is constructed which is Menger graph of a self-dual (1024)-configuration and K4-ultrahomogeneous. As Y is not a line graph, we ask whether there exists a non-line-graphical K4-ultrahomogeneous Menger graph of a self-dual (n4)-configuration which is connected edge-disjoint union of n copies of K4, for n / ∈ {42, 102}. Moreover, Y ...
متن کاملOn Biggs-Smith graph in C-UH-graph context
A method of construction of C-ultrahomogeneous (or C-UH) graphs is applied to the Biggs-Smith graph, which is seen in the process to be a {C9}P4 -UH graph and a { ~ C9} ~ P4 -UH digraph, in order to demonstrate the existence of a connected edge-disjoint union Y of 102 tetrahedra (K4 s), or also union Y of 102 cuboctahedra (L(Q3) s) with no common 4-cycles, possesing a C-UH property for C = {K4}...
متن کاملOn a Biggs-Smith self-dual (1024)-configuration
A construction based on the Biggs-Smith graph is shown to produce an edge-disjoint union of 102 copies of K4 forming a {K4, L(Q3)}K3 -ultrahomogeneous graph dressed as the non-line-graphical Menger graph of a self-dual (1024)-configuration. This stands in contrast to the selfdual (424)-configuration of [8], whose Menger graph is a non-line-graphical {K4, K2,2,2}K2 -ultrahomogeneous graph.
متن کاملOn C-ultrahomogeneous graphs and digraphs
The notion of a C-ultrahomogeneous graph, due to Isaksen et al., is adapted for digraphs and studied for the twelve cubic distance transitive graphs, with C formed by g-cycles and (k − 1)-paths, where g = girth and k = arc-transitivity. Excluding the Petersen, Heawood and Foster (90 vertices) graphs, one can go further by considering the (k− 1)-powers of g-cycles under orientation assignments p...
متن کاملA construction based on the Biggs-Smith graph
Departing from the Biggs-Smith graph, we construct a connected 12regular 102-vertex graph Y of diameter 3 that can be presented as the edge-disjoint union of 102 copies of K4 or as the square-disjoint union of 102 cuboctahedra L(Q3), with each edge shared by four L(Q3)s and each triangle shared by two L(Q3)s and a sole copy of K4. Moreover, Y is the non-line-graphical Menger graph of a self-dua...
متن کامل